Transparent Query Caching in Peer-to-Peer Overlay Networks
نویسندگان
چکیده
Peer-to-peer (p2p) systems such as Gnutella and KaZaa are routinely used by millions of people for sharing music and many other files over the Internet, and they account for a significant portion of the Internet traffic. The p2p traffic can be broken down into two categories: protocol messages for maintaining and searching the overlay p2p network, and data messages for downloading data files. This paper makes the following two contributions. First, we present a study of the locality in the collective Gnutella query protocol messages being initiated and forwarded by servents within the same organization. Second, we propose a transparent query caching scheme to reduce the bandwidth consumed by p2p traffic going in and out of the gateway of an organization. Our locality measurements show that there is significant locality in the collective queries going through a gateway forwarded by servents behind that gateway, and the locality increases with the population of those servents. Our proposed transparent caching scheme preserves the user experience, i.e., users continue to use the same servents as before, and queries will result in similar query hits with or without the caching running. Measurements of our transparent caching proxy in an experimental testbed of eight passive Gnutella servents in a LAN has shown a query cache hit rate of up to 38%, an uplink query traffic reduction of up to 40%, and a downlink query hit traffic reduction of up to 12% at the gateway.
منابع مشابه
A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملSelf-configuration protocols for P2P networks
This paper proposes and evaluates different protocols for individual peers to self-configure the P2P overlay networks in various network environments. For smallscale homogeneous networks, an optimizer peer selection protocol is proposed and found to be superior to other peer selection protocols, including random, egoist, altruist and greedy protocols, in terms of network diameter and node eccen...
متن کاملOn the Equivalence of Forward and Reverse Query Caching in Peer-to-Peer Overlay Networks
Peer-to-peer systems such as Gnutella and Kazaa are used by millions of people for sharing music and many other files over the Internet, and they account for a significant portion of the Internet traffic. The traffic in a peer-to-peer overlay network is different from that in WWW in that each peer is both a client and a server. This suggests that one can deploy a forward cache at the Internet g...
متن کاملKnowledge and Cache based Adaptive Query Searching in Unstructured P2P Networks
Efficient search is a challenging task in unstructured peer-to-peer networks. In this paper, Knowledge and Cache based Adaptive Query Searching (KCAQS) is proposed that adaptively performs a query searching through either directed flooding or biased random walk based on the number of hop counts in query message. In addition, knowledge intended forwarding is deployed for forwarding a query to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003